Counting as Method , Model and Task in Theoretical Computer Science
نویسنده
چکیده
family of languages, 59AC, 80AC, 21ACC, 80advice, 17, 26AFL, 59alternation, 19automatonfinite, 83Auxiliary Pushdown Automaton, 18AuxPDA, 18 BDD, 53Binary Decision Diagrams, 53BLIND, 64bounded, 70bounded fan-in, 21Branching Programs, 53 carrier set, 119ccc, 73cdc, 74certificate, 31CFLth, 64, 67characteristic function, 15clow sequence, 42complement, 88complexity class, 13Concurrent, 22congruence, 60connectedness, 102connectivity problem, 14context-free complement constr., 73context-free deterministic constr., 74counter, 84counting quantifier, 81covering graph, 129 descriptive complexity, 79Det, 21deterministic recognition, 104deterministically recognizable, 105DLOGTIME-Uniformity, 21double counting, 27DSPACE, 13DTIME, 13Dyck-Language, 60 EAΣ, 20elementary transition, 119emptiness problem, 60empty alternation, 20Exclusive, 22existential second order logic, 81expression, 119 firing sequence, 114
منابع مشابه
Soccer Goalkeeper Task Modeling and Analysis by Petri Nets
In a robotic soccer team, goalkeeper is an important challenging role, which has different characteristics from the other teammates. This paper proposes a new learning-based behavior model for a soccer goalkeeper robot by using Petri nets. The model focuses on modeling and analyzing, both qualitatively and quantitatively, for the goalkeeper role so that we have a model-based knowledge of the ta...
متن کاملCompressed counting
Abstract Counting is a fundamental operation. For example, counting the αth frequency moment, F(α) = ∑D i=1 At[i] , of a streaming signal At (where t denotes time), has been an active area of research, in theoretical computer science, databases, and data mining. When α = 1, the task (i.e., counting the sum) can be accomplished using a counter. When α 6= 1, however, it becomes non-trivial to des...
متن کاملTask Scheduling Algorithm Using Covariance Matrix Adaptation Evolution Strategy (CMA-ES) in Cloud Computing
The cloud computing is considered as a computational model which provides the uses requests with resources upon any demand and needs.The need for planning the scheduling of the user's jobs has emerged as an important challenge in the field of cloud computing. It is mainly due to several reasons, including ever-increasing advancements of information technology and an increase of applications and...
متن کاملA New WordNet Enriched Content-Collaborative Recommender System
The recommender systems are models that are to predict the potential interests of users among a number of items. These systems are widespread and they have many applications in real-world. These systems are generally based on one of two structural types: collaborative filtering and content filtering. There are some systems which are based on both of them. These systems are named hybrid recommen...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملTask Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids
In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005